翻訳と辞書 |
Johnson graph : ウィキペディア英語版 | Johnson graph
Johnson graphs are a special class of undirected graphs defined from systems of sets. The vertices of the Johnson graph are the -element subsets of an -element set; two vertices are adjacent when they meet in a -element set.〔.〕 Both Johnson graphs and the closely related Johnson scheme are named after Selmer M. Johnson. ==Special Cases==
* is the complete graph . * is the octahedral graph. * is the complement graph of the Petersen graph,〔 hence the line graph of . More generally, for all , the Johnson graph is the complement of the Kneser graph
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Johnson graph」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|